منابع مشابه
CLAN: Closely reLated ApplicatioNs
Although popular text search engines allow users to retrieve similar web pages, source code search engines do not have this feature. Knowing similarity between applications plays an important role in improving understanding and assessing reusability of these applications, rapid prototyping, and discovering code theft and plagiarism. However, detecting similar applications is a notoriously diffi...
متن کاملConvex Games versus clan Games
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a dualize and restrictprocedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic convex game generates a total clan game with zero worth for the clan by a dualize and extend pr...
متن کاملVIA over the CLAN Network
The Virtual Interface Architecture is an industry standard for high performance networking in system-area networks, and the same model is proposed for Infiniband. Existing implementations suffer from high complexity, and scaling to higher bandwidths and large numbers of endpoints is likely to be problematic. We present a novel implementation of VIA that consists of a thin software layer over th...
متن کاملCoLoSS : The Coalgebraic Logic Satisfiability Solver ( System Description ) Georgel Calin
CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...
متن کاملPopular and Clan-Popular b-Matchings
Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties, and each agent and house has their capacity denoting the maximum number of houses/agents (respectively) that can be matched to him/her/it. We want to find a matching M , called popular, for which there is no other matching M ′ such that more agents prefer M ′ to M than M to M ′, sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archéologie médiévale
سال: 2013
ISSN: 0153-9337,2608-4228
DOI: 10.4000/archeomed.9849